Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
نویسندگان
چکیده
Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem. The problem is useful in the design of networks in telecommunications and airline transportation systems. We propose a 2(1 − 1/h)-approximation algorithm where h denotes the number of hub nodes. Our algorithm solves a linear relaxation problem and employs a dependent rounding procedure. We analyze our algorithm by approximating a given cycle-metric matrix by a convex combination of Monge matrices.
منابع مشابه
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case
Transportation networks frequently employ hub-and-spoke network architectures to route flows between many origin and destination pairs. In this paper, we deal with a problem, called the single allocation hub-and-spoke network design problem. In the single allocation hub-andspoke network design problem, the goal is to allocate each non-hub node to exactly one of given hub nodes so as to minimize...
متن کاملApproximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
This paper deals with a single allocation problem in hub-and-spoke networks. We present a simple deterministic 3-approximation algorithm and randomized 2-approximation algorithm based on a linear relaxation problem and a randomized rounding procedure. We handle the case where the number of hubs is three, which is known to be NP-hard, and present a (5/4)-approximation algorithm. The single alloc...
متن کاملApproximating k-outconnected Subgraph Problems
We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for nding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle th...
متن کاملIntegrated Competitive Pricing and Transshipment Problem for Short Life Cycle Products’ Supply Chain
This paper integrates competitive pricing and network design problems for the short life cycle products. The pricing problem determines selling prices of the products for different life cycle phases in a competitive market, as well as acquisition management of returned products. Besides, the selling and acquisition prices are related to the distance between distribution centers and customers. T...
متن کاملA Hybrid Solution Method for Hub-and-Spoke Network Design under Uncertainty
Supply chain is an integrated system of facilities and activities. Gaining the optimum design of demand satisfaction network is one of the most important live issues in the decision making problems category. Most of previous studies considered unreal assumptions such as the lack of capacity constraints to satisfy demand in the network and in hubs. By considering the nature of the case that have...
متن کامل